An alternation theory for copositive approximation
نویسندگان
چکیده
منابع مشابه
An Adaptive Linear Approximation Algorithm for Copositive Programs
We study linear optimization problems over the cone of copositive matrices. These problems appear in nonconvex quadratic and binary optimization; for instance, the maximum clique problem and other combinatorial problems can be reformulated as such problems. We present new polyhedral inner and outer approximations of the copositive cone which we show to be exact in the limit. In contrast to prev...
متن کاملWeak Copositive and Intertwining Approximation
It is known that shape preserving approximation has lower rates than unconstrained approximation. This is especially true for copositive and intertwining approximations. For f 2 L p , 1 p < 1, the former only has rate ! ' (f; n ?1) p , and the latter can not even be bounded by Ckfk p. In this paper, we discuss various ways to relax the restrictions in these approximations and conclude that the ...
متن کاملDiathesis alternation approximation for verb clustering
Although diathesis alternations have been used as features for manual verb classification, and there is recent work on incorporating such features in computational models of human language acquisition, work on large scale verb classification has yet to examine the potential for using diathesis alternations as input features to the clustering process. This paper proposes a method for approximati...
متن کاملAn algorithm for determining copositive matrices
In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial subdivision of T̂ = {y ∈ ∆m|β y ≤ 0} on the standard simplex ∆m, where each component of the vector β is -1, 0 or 1.
متن کاملPositive and Copositive Spline Approximation in L P 0; 1]
The order of positive and copositive spline approximation in the L p-norm, 1 p < 1, is studied, the main results are (1) the error of positive approximation by splines is bounded by C! 2 (f; 1=n) p if f has a nonnegative extension; (2) the order deteriorates to ! 1 if f does not have such an extension; (3) the error of copositive spline approximation is bounded by C!(f; 1=n) p ; (4) if f is als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1977
ISSN: 0021-9045
DOI: 10.1016/0021-9045(77)90034-x